Routing of ALVs under Uncertainty in Automated Container Terminals

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

Automated Technologies in Maritime Container Terminals

The purpose of this article is to investigate the potentials of implementing an integrated Automated Storage and Retrieval System (ASRS) and Automated Guided Vehicle System (AGVS) in maritime container terminals. We first define the main components of the proposed configuration and justify the potential impacts of each and that of the integrated system. A 3D simulation (and animation) model is ...

A Simulation Model for Automated Container Terminals

In order to accommodate the growing intercontinental container transport, port facilities have to be up-scaled drastically. The challenge is to develop facilities that can handle a new generation of ships, the jumbo container vessels, with a capacity of 8,000 TEU (Twenty-foot Equivalent Unit) or more. The total in-port time to serve these jumbos is set at 24 hours. This amounts to almost double...

Improving Quay Transport on Automated Container Terminals

In order to accommodate the growth in intercontinental container transport, port facilities have to be up-scaled drastically. One of the major challenges is to increase the capacity of the marine operation on a container terminal. In this study the model of a quay transport system using automated guided vehicles (AGVs) is used to deduce logistic principles for the design of a terminal layout an...

Simulating Dispatching Strategies for Automated Container Terminals